Computational Complexity of One-Tape Turing Machine Computations
نویسندگان
چکیده
منابع مشابه
One-Tape, Off-Line Turing Machine Computations
In this paper we shall consider Turing machines tha t can, at any given step in their computations, do each of the following things: (a) change the tape symbols currently scanned by their reading heads, (b) shift each of their tapes one square to the left or right, (c) change their internal state, and (d) halt. Each step is assumed to require exactly one t ime unit for its completion. I n order...
متن کاملTape-Reversal Bounded Turing Machine Computations
This paper studies the classification of recursive sets by the number of tape reversals required for their recognition on a two-tape Turing machine with a one-way input tape. This measure yields a rich hierarchy of tape-reversal limited complexity classes and their properties and ordering are investigated. The most striking difference between this and the previously studied complexity measures ...
متن کاملOn the Algebraic Representation of One-Tape Deterministic Turing Machine
An algebraic representation of the Turing machines is given, where the configurations of Turing machines are represented by 4 order tensors, and the transition functions by 8 order tensors. Two types of tensor product are defined, one is to model the evolution of the Turing machines, and the other is to model the compositions of transition functions. It is shown that the two types of tensor pro...
متن کاملThe Complexity of Matrix Transposition on One-Tape Off-Line Turing Machines with Output Tape
Dietzfelbinger. hl. and W' hlaass. The complexity of matrrx transposition on one-tape off-line Turing machines with output tape, Thcorettcal A series of existing lower bound results for deterministic one-tape Turing machines is extended to another, stronger such model suttable for the computatton of functions: one-tape off-line Turing machines wtth a wrote-only output tape. (" OfT-line " means:...
متن کاملNondeterministic One-Tape Off-Line Turing Machines
Finite state control Semi-infinite tape which contains, at the beginning of the computation: the input string, on its part of the tape the blank symbol, in the remaining squares According to the transition function at each step the machine: changes its internal state writes a nonblank symbol on the scanned tape square moves the head either to the left, or to the right, or keeps it on the same s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 1968
ISSN: 0004-5411,1557-735X
DOI: 10.1145/321450.321464